Combinatorial auctions using rule-based bids
نویسندگان
چکیده
The migration of auctions to the Internet provides a unique opportunity to harness the power of computing to create new auction forms that were previously impossible. We describe a new type of combinatorial auction that accepts rule-based bids. Allowing bids in the form of high-level rules relieves the buyer from the burden of enumerating all possible acceptable bundles. The allocation of goods requires solving a complex combinatorial problem, a task that is completely impractical in a conventional auction setting. We describe simplifying winner determination heuristics developed in this study to make large problems of this nature manageable.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملA Heuristic for Winner Determination in Rule-Based Combinatorial Auctions
Abstract Combinatorial auctions address the sale of materials where there exist complementarities between items. A major stumbling block to the widespread use of combinatorial auctions is the complexity of winner determination known to be NP-complete. We consider a rich version of combinatorial auctions, rule-based combinatorial auctions, where bids consist of rules that describe acceptable bun...
متن کاملAn Agent Based Market Design Methodology for Combinatorial Auctions
Auction mechanisms have attracted a great deal of interest and have been used in diverse emarketplaces. In particular, combinatorial auctions have the potential to play an important role in electronic transactions. Therefore, diverse combinatorial auction market types have been proposed to satisfy market needs. These combinatorial auction types have diverse market characteristics, which require...
متن کاملAn improved Ant Colony Algorithm for Optimal Winner Determination Problem in Reverse Combinatorial Auction
Reverse Combinatorial auctions, that is, auctions where bidders can bid on the supply right of combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-item auctions where the agents' valuations of the items are not additive. A common model is formulated for optimal the winner determination problem of reverse combinatorial auction. A PRIM (P...
متن کاملAlgorithms for Distributed Winner Determination in Combinatorial Auctions
The problem of optimal winner determination in combinatorial auctions consists of finding the set of bids that maximize the revenue for the sellers. Various solutions exist for solving this problem but they are all centralized. That is, they assume that all bids are sent to a centralized auctioneer who then determines the winning set of bids. In this paper we introduce the problem of distribute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Decision Support Systems
دوره 34 شماره
صفحات -
تاریخ انتشار 2002